Diclib.com
Словарь ChatGPT

Поиск в словаре Индивидуальные решения

Введите слово или словосочетание на любом языке 👆

Язык:

Перевод и анализ слов искусственным интеллектом ChatGPT

На этой странице Вы можете получить подробный анализ слова или словосочетания, произведенный с помощью лучшей на сегодняшний день технологии искусственного интеллекта:

как употребляется слово
частота употребления
используется оно чаще в устной или письменной речи
варианты перевода слова
примеры употребления (несколько фраз с переводом)
этимология

jointly dependent variables - перевод на русский

Dependent-marking; Dependent marking

Найдено результатов: 480

jointly dependent variables

совместно зависимые переменные

jointly dependent variables

совместно зависимые переменные

weakly dependent random variables

слабо зависимые случайные величины

unbound variable

$Tree summarizing the syntax of the expression <math>\forall x\, ((\exists y\, A(x)) \vee B(z)) </math>$

CLASSIFICATION OF VARIABLES IN A LOGIC FORMULA BASED ON WHETHER OR NOT THEY ARE INSIDE THE SCOPE OF A QUANTIFIER

Free variable; Bound variable; Variable binding operation; Variable-binding operation; Free variables; Bound variables; Unbound variable; Unbound variables; Variable-binding operator; Variable binding operator; Free and bound variables; Bound variable clash; Free and bound variable; Placeholder (computer programming); Free variables & bound variables; Free occurrence; Placeholder variable; Apparent variable

математика

несвязанная переменная

free variable

$Tree summarizing the syntax of the expression <math>\forall x\, ((\exists y\, A(x)) \vee B(z)) </math>$

CLASSIFICATION OF VARIABLES IN A LOGIC FORMULA BASED ON WHETHER OR NOT THEY ARE INSIDE THE SCOPE OF A QUANTIFIER

Free variable; Bound variable; Variable binding operation; Variable-binding operation; Free variables; Bound variables; Unbound variable; Unbound variables; Variable-binding operator; Variable binding operator; Free and bound variables; Bound variable clash; Free and bound variable; Placeholder (computer programming); Free variables & bound variables; Free occurrence; Placeholder variable; Apparent variable

математика

свободная переменная

apparent variable

$Tree summarizing the syntax of the expression <math>\forall x\, ((\exists y\, A(x)) \vee B(z)) </math>$

CLASSIFICATION OF VARIABLES IN A LOGIC FORMULA BASED ON WHETHER OR NOT THEY ARE INSIDE THE SCOPE OF A QUANTIFIER

Free variable; Bound variable; Variable binding operation; Variable-binding operation; Free variables; Bound variables; Unbound variable; Unbound variables; Variable-binding operator; Variable binding operator; Free and bound variables; Bound variable clash; Free and bound variable; Placeholder (computer programming); Free variables & bound variables; Free occurrence; Placeholder variable; Apparent variable

логика

кажущаяся переменная

связанная переменная

bound variable

$Tree summarizing the syntax of the expression <math>\forall x\, ((\exists y\, A(x)) \vee B(z)) </math>$

CLASSIFICATION OF VARIABLES IN A LOGIC FORMULA BASED ON WHETHER OR NOT THEY ARE INSIDE THE SCOPE OF A QUANTIFIER

Free variable; Bound variable; Variable binding operation; Variable-binding operation; Free variables; Bound variables; Unbound variable; Unbound variables; Variable-binding operator; Variable binding operator; Free and bound variables; Bound variable clash; Free and bound variable; Placeholder (computer programming); Free variables & bound variables; Free occurrence; Placeholder variable; Apparent variable

общая лексика

связанная переменная

free occurrence

$Tree summarizing the syntax of the expression <math>\forall x\, ((\exists y\, A(x)) \vee B(z)) </math>$

CLASSIFICATION OF VARIABLES IN A LOGIC FORMULA BASED ON WHETHER OR NOT THEY ARE INSIDE THE SCOPE OF A QUANTIFIER

Free variable; Bound variable; Variable binding operation; Variable-binding operation; Free variables; Bound variables; Unbound variable; Unbound variables; Variable-binding operator; Variable binding operator; Free and bound variables; Bound variable clash; Free and bound variable; Placeholder (computer programming); Free variables & bound variables; Free occurrence; Placeholder variable; Apparent variable

общая лексика

свободное вхождение

связанное

явное

free variable

$Tree summarizing the syntax of the expression <math>\forall x\, ((\exists y\, A(x)) \vee B(z)) </math>$

CLASSIFICATION OF VARIABLES IN A LOGIC FORMULA BASED ON WHETHER OR NOT THEY ARE INSIDE THE SCOPE OF A QUANTIFIER

Free variable; Bound variable; Variable binding operation; Variable-binding operation; Free variables; Bound variables; Unbound variable; Unbound variables; Variable-binding operator; Variable binding operator; Free and bound variables; Bound variable clash; Free and bound variable; Placeholder (computer programming); Free variables & bound variables; Free occurrence; Placeholder variable; Apparent variable

свободная переменная

dependent country

TERRITORY THAT DOES NOT POSSESS FULL POLITICAL INDEPENDENCE AS A SOVEREIGN STATE

Dependent area; Dependent areas; List of dependent areas; List of not fully sovereign nations; Overseas Territories; Annex to the list of countries; Territories and self-governing areas of sovereign countries; List of dependent territories; Dependent territories; Dependent Territory; Dependent territories of the United States; List of territories; Dependent states; Dependencies and other territories; Dependencies and territories; Dependent countries; Dependent country; External territory; Dependent territory of New Zealand

зависимая страна

Определение

free variable

1. A variable referred to in a function, which is not an argument of the function. In lambda-calculus, x is a {bound variable} in the term M = x . T, and a free variable of T. We say x is bound in M and free in T. If T contains a subterm x . U then x is rebound in this term. This nested, inner binding of x is said to "shadow" the outer binding. Occurrences of x in U are free occurrences of the new x. Variables bound at the top level of a program are technically free variables within the terms to which they are bound but are often treated specially because they can be compiled as fixed addresses. Similarly, an identifier bound to a recursive function is also technically a free variable within its own body but is treated specially. A closed term is one containing no free variables. See also closure, lambda lifting, scope. 2. In logic, a variable which is not quantified (see quantifier).

Показать больше определений

Википедия

Dependent-marking language

A dependent-marking language has grammatical markers of agreement and case government between the words of phrases that tend to appear more on dependents than on heads. The distinction between head-marking and dependent-marking was first explored by Johanna Nichols in 1986, and has since become a central criterion in language typology in which languages are classified according to whether they are more head-marking or dependent-marking. Many languages employ both head and dependent-marking, but some employ double-marking, and yet others employ zero-marking. However, it is not clear that the head of a clause has anything to do with the head of a noun phrase, or even what the head of a clause is.

https://en.wikipedia.org/wiki/Dependent-marking language

Как переводится jointly dependent variables на Русский язык